SRT Division based on Redundant Signed Number
نویسندگان
چکیده
SRT division schemes are presented based on a redundant number operand format aiming high speed operation. The proposed SRT division method based on a redundant binary adder (RBA) and one based on a recoded binary signed digit adder (RBSDA) show a 33% and 50% speed improvement, respectively. The time complexity of the proposed division based on redundant number is O(n); importantly, the redundant number based design is easy to implement due to its structural regularity.
منابع مشابه
Fast low-power shared division and square-root architecture
This paper addresses a fast low-power implementation of a shared division and square-root architecture. Two approaches are considered in this paper; these include the SRT (Sweeney, Robertson and Tocher) approach which does not require prescaling and the GST (generalized Svoboda and Tung) approach which requires prescaling of the operands. This paper makes two important contributions. Although S...
متن کاملA novel implementation of radix-4 floating-point division/square-root using comparison multiples
A new implementation for minimally redundant radix-4 floating-point SRT division/square-root (division/sqrt) with the recurrence in the signed-digit format is introduced. The implementation is developed based on the comparison multiples idea. In the proposed approach, the magnitude of the quotient (root) digit is calculated by comparing the truncated partial remainder with 2 limited precision m...
متن کاملA Fast Radix-4 Floating-Point Divider with Quotient Digit Selection by Comparison Multiples
A new implementation for minimally redundant radix-4 SRT division with the recurrence in the signed-digit format is introduced. The implementation is developed based on the comparison multiples idea. In the proposed approach, the quotient digit’s magnitude is calculated by comparing the truncated partial remainder with two limited precision multiples of the divisor. The sign is determined by in...
متن کاملA Hardware Organization of High-Radix Modular Multiplication for RSA Cryptosystem
Hardware organized modular multiplication based on division algorithm is one of the effective methods used for RSA encryption/decryption. This paper generalizes the hardware organization of the modular multiplication based on the higher-radix SRT division algorithm, and describes the area/time trade-off of the organization. For the number representation we used the signed-digit number system an...
متن کاملCorrection to the 2005 , IEEE Transactions on Computers paper : ” Digit Selection for SRT Division and Square Root ”
It has been pointed out by counterexamples in a 2013 paper in the IEEE Transactions on Computers [1], that there is an error in the previously ibid. in 2005 published paper [2] on the construction of valid digit selection tables for SRT type division and square root algorithms. The error has been corrected, and new results found on selection constants for maximally redundant digit sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008